On minimal augmentation of a graph to obtain an interval graph
نویسندگان
چکیده
منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملMinimal Interval Completion Through Graph Exploration
Given an arbitrary graph G = (V,E) and an interval graph H = (V, F ) with E ⊆ F we say thatH is an interval completion of G. The graphH is called aminimal interval completion of G if, for any sandwich graph H ′ = (V, F ′) with E ⊆ F ′ ⊂ F , H ′ is not an interval graph. In this paper we give a O(nm) time algorithm computing a minimal interval completion of an arbitrary graph. The output is an i...
متن کاملA Note on a graph associated to a commutative ring
The rings considered in this article are commutative with identity. This article is motivated by the work on comaximal graphs of rings. In this article, with any ring $R$, we associate an undirected graph denoted by $G(R)$, whose vertex set is the set of all elements of $R$ and distinct vertices $x,y$ are joined by an edge in $G(R)$ if and only if $Rxcap Ry = Rxy$. In Section 2 of this articl...
متن کاملOn Finding a Smallest Augmentation to Biconnect a Graph
We consider the problem of nding a minimum number of edges whose addition biconnects an undirected graph. This problem has been studied by several other researchers, two of whom presented a linear time algorithm for this problem in an earlier volume of this journal. However that algorithm contains an error which we expose in this paper. We present a corrected linear time algorithm for this prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90022-2